Reconstruction of rooted trees from subtrees
نویسندگان
چکیده
منابع مشابه
Unbalanced Subtrees in Binary Rooted Ordered and Un-ordered Trees
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely unbalanced subtrees, where unbalancing is measured according to the so-called Colless index. The size of the biggest unbalanced subtree becomes then a new parameter w...
متن کاملReconstruction of Trees from Jumbled and Weighted Subtrees
Let T be an edge-labeled graph, where the labels are from a finite alphabet Σ. For a subtree U of T , the Parikh vector of U is a vector of length |Σ| which specifies the multiplicity of each label in U . We ask when T can be reconstructed from the multiset of Parikh vectors of all of its subtrees, or all of its paths, or all of its maximal paths. We consider the analogous problems for weighted...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملEnumeration of subtrees of trees
Let T be a weighted tree. The weight of a subtree T1 of T is defined as the product of weights of vertices and edges of T1. We obtain a linear-time algorithm to count the sum of weights of subtrees of T . As applications, we characterize the tree with the diameter at least d, which has the maximum number of subtrees, and we characterize the tree with the maximum degree at least ∆, which has the...
متن کاملOptimizing constrained subtrees of trees
Given a tree G = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the "rooted subtree problem", is to find a maximum weight subtree, with a specified root, from a given set of subtrees. The second problem, called "the subtree packing problem", is to find a maximum weight packing of node disjoint subtrees chosen from a given set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00074-2